t=int(input())
for i in range(t):
n=int(input())
a=input()
a1=a.split()
for i in range(n): a1[i]=int(a1[i])
a1.sort()
b=1 for i in range(1,n):
if a1[i]-a1[i-1]==1:
b=2
break
print(b)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
const long long MOD = 1e9 , OO = 1e18;
const double PI = acos(-1);
const int N = 1e5 + 5;
void solve()
{
int n,ok = 0;
cin >> n;
int a[n];
for (int i = 0 ;i < n ;i++) cin >> a[i];
sort (a,a+n);
for(int i = 0; i< n - 1;i++){
if (a[i+1] - a[i] == 1) ok = 1;
}
if (ok) cout << "2\n";
else cout << "1\n";
return;
}
int main()
{
IO
ll t = 1;
cin >> t;
while (t--)
{
solve();
}
return 0;
}368B - Sereja and Suffixes | 1665C - Tree Infection |
1665D - GCD Guess | 29A - Spit Problem |
1097B - Petr and a Combination Lock | 92A - Chips |
1665B - Array Cloning Technique | 1665A - GCD vs LCM |
118D - Caesar's Legions | 1598A - Computer Game |
1605A - AM Deviation | 1461A - String Generation |
1585B - Array Eversion | 1661C - Water the Trees |
1459A - Red-Blue Shuffle | 1661B - Getting Zero |
1661A - Array Balancing | 1649B - Game of Ball Passing |
572A - Arrays | 1455A - Strange Functions |
1566B - MIN-MEX Cut | 678C - Joty and Chocolate |
1352E - Special Elements | 1520E - Arranging The Sheep |
1157E - Minimum Array | 1661D - Progressions Covering |
262A - Roma and Lucky Numbers | 1634B - Fortune Telling |
1358A - Park Lighting | 253C - Text Editor |